How much does it cost to buy a good Google PageRank?

نویسنده

  • Andrew Clausen
چکیده

The PageRank algorithm is used by the popular Google search engine to rate website reputation. It is one of the key ingredients that affects placement in search results coveted by webmasters. I prove that attempts to manipulate a site’s PageRank by creating “link farms” are futile, and that PageRanks can only be increased by either recommendations from reputable websites or by buying domain names. I derive a tight lower bound on the cost of the latter technique. I use these theoretical results to estimate what this lower bound means in $US at the time of writing. I also discovered a mistake in the definition of PageRank in the original paper. This is discussed in the appendix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PageRank algorithm and Monte Carlo methods in PageRank Computation

PageRank is the algorithm used by the Google search engine for ranking web pages. PageRank Algorithm calculates for each page a relative importance score which can be interpreted as the frequency of how often a page is visited by a surfer. The purpose of this work is to provide a mathematical analysis of the PageRank Algorithm. We analyze the random surfer model and the linear algebra behind it...

متن کامل

Investigating the impact of the blogosphere: Using PageRank to determine the distribution of attention

Much has been written in recent years about the blogosphere and its impact on political, educational and scientific debates. Lately the issue has received significant attention from the industry. As the blogosphere continues to grow, even doubling its size every six months, this paper investigates its apparent impact on the overall Web itself. We use the popular Google PageRank algorithm which ...

متن کامل

Universiteit Leiden

In 1999, Page et al. described their algorithm — PageRank — for scoring pages in their web search engine, Google. Already from the start it was clear that due to the large number of pages to be ranked, the PageRank algorithm’s efficiency and optimal performance was and is a critical feature. One method of increasing the efficiency of calculations is based on MapReduce, also originally published...

متن کامل

The Sleekest Link Algorithm

How does Google decide which web sites are important? It uses an ingenious algorithm that exploits the structure of the web and is resistant to hacking. Here, we describe this PageRank algorithm, illustrate it by example, and show how it can be interpreted as a Jacobi iteration and a teleporting random walk. We also ask the algorithm to rank the undergraduate mathematics classes offered at the ...

متن کامل

Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer

The PageRank updating algorithm proposed by Langville and Meyer is a special case of an iterative aggregation/disaggregation (SIAD) method for computing stationary distributions of very large Markov chains. It is designed, in particular, to speed up the determination of PageRank, which is used by the search engine Google in the ranking of web pages. In this paper the convergence, in exact arith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003